A New Median Graph Algorithm
نویسندگان
چکیده
Median graph is an important new concept introduced to represent a set of graphs by a representative graph. Computing the median graph is an NPComplete problem. In this paper, we propose an approximate algorithm for computing the median graph. Our algorithm performs in two steps. It first carries out a node reduction process using a clustering method to extract a subset of most representative node labels. It then searches for the median graph candidates from the reduced subset of node labels according to a deterministic strategy to explore the candidate space. Comparison with the genetic search based algorithm will be reported. This algorithm can be used to build a graph clustering algorithm.
منابع مشابه
Sampling from social networks’s graph based on topological properties and bee colony algorithm
In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...
متن کاملA practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملImproved Adaptive Median Filter Algorithm for Removing Impulse Noise from Grayscale Images
Digital image is often degraded by many kinds of noise during the process of acquisition and transmission. To make subsequent processing more convenient, it is necessary to decrease the effect of noise. There are many kinds of noises in image, which mainly include salt and pepper noise and Gaussian noise. This paper focuses on median filters to remove the salt and pepper noise. After summarizin...
متن کاملA PRACTICAL APPROACH TO REAL-TIME DYNAMIC BACKGROUND GENERATION BASED ON A TEMPORAL MEDIAN FILTER
In many computer vision applications, segmenting and extraction of moving objects in video sequences is an essential task. Background subtraction, by which each input image is subtracted from the reference image, has often been used for this purpose. In this paper, we offer a novel background-subtraction technique for real-time dynamic background generation using color images that are taken fro...
متن کاملA graph search algorithm: Optimal placement of passive harmonic filters in a power system
The harmonic in distribution systems becomes an important problem due to an increase in nonlinear loads. This paper presents a new approach based on a graph algorithm for optimum placement of passive harmonic filters in a multi-bus system, which suffers from harmonic current sources. The objective of this paper is to minimize the network loss, the cost of the filter and the total harmonic disto...
متن کامل